An Approach to Solving Combinatorial Optimization Problems Using a Population of Reinforcement Learning Agents
نویسنده
چکیده
This paper presents an approach that uses reinforcement learning (RL) algorithms to solve combinatorial optimization problems. In particular, the approach combines both local and global search characteristics: local information as encoded by typical RL schemes and global information as contained in a population of search agents. The effectiveness of the approach is demonstrated on both the Asymmetric Traveling Salesman (ATSP) and the Quadratic Assignment Problem (QAP). These results are competitive with other well-known search techniques and suggest that the presented RLagent approach can be used as a basis for global optimization techniques.
منابع مشابه
Global Search in Combinatorial Optimization using Reinforcement Learning Algorithms
This paper presents two approaches that address the problems of the local character of the search and imprecise state representation of reinforcement learning (RL) algorithms for solving combinatorial optimization problems. The first, Bayesian, approach aims to capture solution parameter interdependencies. The second approach combines local information as encoded by typical RL schemes and globa...
متن کاملOutsourcing or Insourcing of Transportation System Evaluation Using Intelligent Agents Approach
Nowadays, outsourcing is viewed as a trade strategy and organizations tend to adopt new strategies to achieve competitive advantages in the current world of business. focusing on main copmpetencies, and transferring most of activities to outside resources of organization( outsourcing) is one such strategy is. In this paper, we aim to decide on decision maker agent of transportation system, by a...
متن کاملA Software Framework for Solving Combinatorial Optimization Tasks
Due to the major practical importance of combinatorial optimization problems, many approaches for tackling them have been developed. As the problem of intelligent solution generation can be approached with reinforcement learning techniques, we aim at presenting in this paper a programming interface for solving combinatorial optimization problems using reinforcement learning techniques. The adva...
متن کاملSelecting Efficient Service-providers in Electric Power Distribution Industry Using Combinatorial Reverse Auction
In this paper, a combinatorial reverse auction mechanism is proposed for selecting the most efficient service-providers for resolving sustained power interruptions in multiple regions of an electric power distribution company’s responsibility area. Through this mechanism, supplying the required service in each region is assigned to only one potential service-provider considering two criteria in...
متن کاملA Reinforcement Learning Model for Solving the Folding Problem
In this paper we aim at proposing a reinforcement learning based model for solving combinatorial optimization problems. Combinatorial optimization problems are hard to solve optimally, that is why any attempt to improve their solutions is beneficent. We are particularly focusing on the bidimensional protein folding problem, a well known NP-hard optimizaton problem important within many fields i...
متن کامل